Checking experiments with non-observable tree FSMs
نویسندگان
چکیده
منابع مشابه
Fault Latencies of Concurrent Checking FSMs
In this paper we introduce concepts of a potential fault latency and a real fault latency for Finite State Machines (FSMs). The potential latency defines a minimal value of the possible latency for an FSM, while the real latency relates to the certain implementation of the FSM. A method for investigation of latencies for online checking FSMs is described. This technique is based on selection of...
متن کاملExperiments with a Tautology Checking Algorithm
This paper presents various versions of a tautology checking algorithm that is related both to St̊almarck’s algorithm and the mechanism described by Kunz and Stoffel in Reasoning in Boolean Networks[KS97]. The algorithm uses as its central data structure the conjunction of a set of terms, with each term being a relation over a small number of variables. In St̊almarck’s algorithm the relation is l...
متن کاملStochastic games with non-observable actions
We examine n-player stochastic games. These are dynamic games where a play evolves in stages along a finite set of states; at each stage players independently have to choose actions in the present state and these choices determine a stage payoff to each player as well as a transition to a new state where actions have to be chosen at the next stage. For each player the infinite sequence of his s...
متن کاملSufficient Completeness Checking with Propositional Tree Automata
Su cient completeness means that enough equations have been speci ed, so that the functions of an equational speci cation are fully de ned on all relevant data. This is important for both debugging and formal reasoning. In this work we extend su cient completeness methods to handle expressive speci cations involving: (i) partiality; (ii) conditional equations; and (iii) deductionmodulo axioms. ...
متن کاملMultiple Tree for Partially Observable Monte-Carlo Tree Search
We propose an algorithm for computing approximate Nash equilibria of partially observable games using Monte-Carlo tree search based on recent bandit methods. We obtain experimental results for the game of phantom tic-tac-toe, showing that strong strategies can be efficiently computed by our algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of the RAS
سال: 2015
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2015-27(6)-28